Multi-level, single-machine lot sizing and scheduling (with initial inventory)
نویسندگان
چکیده
منابع مشابه
Two-level lot-sizing with inventory bounds
We study a two-level uncapacitated lot-sizing problem with inventory bounds that occurs in a supply chain composed of a supplier and a retailer. The first level with the demands is the retailer level and the second one is the supplier level. The aim is to minimize the cost of the supply chain so as to satisfy the demands when the quantity of item that can be held in inventory at each period is ...
متن کاملA genetic algorithm for multi-level, multi-machine lot sizing and scheduling
This contribution introduces a mixed{integer programming formulation for the multi{level, multi{machine proportional lot sizing and scheduling problem. It also presents a genetic algorithm to solve that problem. The e ciency of that algorithm is due to an encoding of solutions which uses a two{dimensional matrix representation with non{binary entries rather than a simple bitstring. A computatio...
متن کاملLot sizing with inventory gains
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one in which stock is not conserved. That is, the stock in inventory undergoes a transformation in each period that is independent of the period in which the item was produced. A 0 1 mixed integer programming formulation o...
متن کاملOptimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time
In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...
متن کاملOn Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies
We consider a problem of multi-product lot-sizing and scheduling where each product can be produced by a family of alternative multi-machine technologies. Multi-machine technologies require one or more machine at the same time. A sequence dependent setup time is needed between different technologies. The criterion is to minimize the makespan. Preemptive and non-preemptive versions of the proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1996
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(96)90056-9